Area Requirement of Gabriel Drawings
نویسندگان
چکیده
In this paper we investigate the area requirement of proximity drawings and we prove an exponential lower bound. Namely, our main contribution is to show the existence of a class of Gabriel-drawable graphs that require exponential area for any Gabriel drawing and any resolution rule. Also, we extend the result to an innnite class of proximity drawings.
منابع مشابه
Area Requirement of Gabriel Drawings ? (extended Abstract)
In this paper we investigate the area requirement of proximity drawings and we prove an exponential lower bound. Our main contribution is to show the existence of a class of Gabriel-drawable graphs that require exponential area for any Gabriel drawing and any resolution rule. The result is further extended to an innnite class of proximity drawings.
متن کاملProximity Drawings: Three Dimensions Are Better than Two
We consider weak Gabriel drawings of unbounded degree trees in the three-dimensional space. We assume a minimum distance between any two vertices. Under the same assumption, there exists an exponential area lower bound for general graphs. Moreover, all previously known algorithms to construct (weak) proximity drawings of trees, generally produce exponential area layouts, even when we restrict o...
متن کاملProximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially with the size of the graph. This holds even when we restrict ourselves to binary trees. Our method is quite general and yields the first algorithms to construct (a) polynomial area weak Gabriel drawings of ternary trees...
متن کاملProximity drawings of binary trees in polynomial area
In this paper we study weak proximity drawings All known algorithms that compute weak proximity drawings produce representations whose area increases exponentially with the number of vertices Additionally an exponential lower bound on the area of weak proximity drawings of general graph has been proved We present the rst algorithms that compute a polynomial area proximity drawing of binary and ...
متن کاملArea-eecient Upward Tree Drawings
Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
متن کامل